Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar14/nonterminSLASHCSRSLASHEx9

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, filter₃(Y, N, M))
sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(N), sieve₁(filter₃(Y, N, N)))
nats₁(N) -> cons₂(N, nats₁(s₁(N)))
zprimes -> sieve₁(nats₁(s₁(s₁(0))))

Q is empty.

↳ QTRS

  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, filter₃(Y, N, M))
sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(N), sieve₁(filter₃(Y, N, N)))
nats₁(N) -> cons₂(N, nats₁(s₁(N)))
zprimes -> sieve₁(nats₁(s₁(s₁(0))))

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, filter₃(Y, N, M))
sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(N), sieve₁(filter₃(Y, N, N)))
nats₁(N) -> cons₂(N, nats₁(s₁(N)))
zprimes -> sieve₁(nats₁(s₁(s₁(0))))

The set Q consists of the following terms:

filter₃(cons₂(x0, x1), 0, x2)
filter₃(cons₂(x0, x1), s₁(x2), x3)
sieve₁(cons₂(0, x0))
sieve₁(cons₂(s₁(x0), x1))
nats₁(x0)
zprimes

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

SIEVE₁(cons₂(s₁(N), Y)) -> SIEVE₁(filter₃(Y, N, N))
ZPRIMES -> SIEVE₁(nats₁(s₁(s₁(0))))
SIEVE₁(cons₂(s₁(N), Y)) -> FILTER₃(Y, N, N)
FILTER₃(cons₂(X, Y), s₁(N), M) -> FILTER₃(Y, N, M)
FILTER₃(cons₂(X, Y), 0, M) -> FILTER₃(Y, M, M)
SIEVE₁(cons₂(0, Y)) -> SIEVE₁(Y)
ZPRIMES -> NATS₁(s₁(s₁(0)))
NATS₁(N) -> NATS₁(s₁(N))

The TRS R consists of the following rules:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, filter₃(Y, N, M))
sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(N), sieve₁(filter₃(Y, N, N)))
nats₁(N) -> cons₂(N, nats₁(s₁(N)))
zprimes -> sieve₁(nats₁(s₁(s₁(0))))

The set Q consists of the following terms:

filter₃(cons₂(x0, x1), 0, x2)
filter₃(cons₂(x0, x1), s₁(x2), x3)
sieve₁(cons₂(0, x0))
sieve₁(cons₂(s₁(x0), x1))
nats₁(x0)
zprimes

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

SIEVE₁(cons₂(s₁(N), Y)) -> SIEVE₁(filter₃(Y, N, N))
ZPRIMES -> SIEVE₁(nats₁(s₁(s₁(0))))
SIEVE₁(cons₂(s₁(N), Y)) -> FILTER₃(Y, N, N)
FILTER₃(cons₂(X, Y), s₁(N), M) -> FILTER₃(Y, N, M)
FILTER₃(cons₂(X, Y), 0, M) -> FILTER₃(Y, M, M)
SIEVE₁(cons₂(0, Y)) -> SIEVE₁(Y)
ZPRIMES -> NATS₁(s₁(s₁(0)))
NATS₁(N) -> NATS₁(s₁(N))

The TRS R consists of the following rules:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, filter₃(Y, N, M))
sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(N), sieve₁(filter₃(Y, N, N)))
nats₁(N) -> cons₂(N, nats₁(s₁(N)))
zprimes -> sieve₁(nats₁(s₁(s₁(0))))

The set Q consists of the following terms:

filter₃(cons₂(x0, x1), 0, x2)
filter₃(cons₂(x0, x1), s₁(x2), x3)
sieve₁(cons₂(0, x0))
sieve₁(cons₂(s₁(x0), x1))
nats₁(x0)
zprimes

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 3 SCCs with 3 less nodes.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

NATS₁(N) -> NATS₁(s₁(N))

The TRS R consists of the following rules:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, filter₃(Y, N, M))
sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(N), sieve₁(filter₃(Y, N, N)))
nats₁(N) -> cons₂(N, nats₁(s₁(N)))
zprimes -> sieve₁(nats₁(s₁(s₁(0))))

The set Q consists of the following terms:

filter₃(cons₂(x0, x1), 0, x2)
filter₃(cons₂(x0, x1), s₁(x2), x3)
sieve₁(cons₂(0, x0))
sieve₁(cons₂(s₁(x0), x1))
nats₁(x0)
zprimes

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FILTER₃(cons₂(X, Y), 0, M) -> FILTER₃(Y, M, M)
FILTER₃(cons₂(X, Y), s₁(N), M) -> FILTER₃(Y, N, M)

The TRS R consists of the following rules:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, filter₃(Y, N, M))
sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(N), sieve₁(filter₃(Y, N, N)))
nats₁(N) -> cons₂(N, nats₁(s₁(N)))
zprimes -> sieve₁(nats₁(s₁(s₁(0))))

The set Q consists of the following terms:

filter₃(cons₂(x0, x1), 0, x2)
filter₃(cons₂(x0, x1), s₁(x2), x3)
sieve₁(cons₂(0, x0))
sieve₁(cons₂(s₁(x0), x1))
nats₁(x0)
zprimes

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

FILTER₃(cons₂(X, Y), 0, M) -> FILTER₃(Y, M, M)
FILTER₃(cons₂(X, Y), s₁(N), M) -> FILTER₃(Y, N, M)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
FILTER₃(x1, x2, x3) = x1
cons₂(x1, x2) = cons₂(x1, x2)
0 = 0
s₁(x1) = s

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, filter₃(Y, N, M))
sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(N), sieve₁(filter₃(Y, N, N)))
nats₁(N) -> cons₂(N, nats₁(s₁(N)))
zprimes -> sieve₁(nats₁(s₁(s₁(0))))

The set Q consists of the following terms:

filter₃(cons₂(x0, x1), 0, x2)
filter₃(cons₂(x0, x1), s₁(x2), x3)
sieve₁(cons₂(0, x0))
sieve₁(cons₂(s₁(x0), x1))
nats₁(x0)
zprimes

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

SIEVE₁(cons₂(s₁(N), Y)) -> SIEVE₁(filter₃(Y, N, N))
SIEVE₁(cons₂(0, Y)) -> SIEVE₁(Y)

The TRS R consists of the following rules:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, filter₃(Y, N, M))
sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(N), sieve₁(filter₃(Y, N, N)))
nats₁(N) -> cons₂(N, nats₁(s₁(N)))
zprimes -> sieve₁(nats₁(s₁(s₁(0))))

The set Q consists of the following terms:

filter₃(cons₂(x0, x1), 0, x2)
filter₃(cons₂(x0, x1), s₁(x2), x3)
sieve₁(cons₂(0, x0))
sieve₁(cons₂(s₁(x0), x1))
nats₁(x0)
zprimes

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

SIEVE₁(cons₂(0, Y)) -> SIEVE₁(Y)

The remaining pairs can at least by weakly be oriented.

SIEVE₁(cons₂(s₁(N), Y)) -> SIEVE₁(filter₃(Y, N, N))

Used ordering: Combined order from the following AFS and order.
SIEVE₁(x1) = SIEVE₁(x1)
cons₂(x1, x2) = cons₁(x2)
s₁(x1) = s₁(x1)
filter₃(x1, x2, x3) = filter₁(x1)
0 = 0

Lexicographic Path Order [19].
Precedence:

[SIEVE₁, cons₁, filter_1] > 0

The following usable rules [14] were oriented:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, filter₃(Y, N, M))

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

SIEVE₁(cons₂(s₁(N), Y)) -> SIEVE₁(filter₃(Y, N, N))

The TRS R consists of the following rules:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, filter₃(Y, N, M))
sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(N), sieve₁(filter₃(Y, N, N)))
nats₁(N) -> cons₂(N, nats₁(s₁(N)))
zprimes -> sieve₁(nats₁(s₁(s₁(0))))

The set Q consists of the following terms:

filter₃(cons₂(x0, x1), 0, x2)
filter₃(cons₂(x0, x1), s₁(x2), x3)
sieve₁(cons₂(0, x0))
sieve₁(cons₂(s₁(x0), x1))
nats₁(x0)
zprimes

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

SIEVE₁(cons₂(s₁(N), Y)) -> SIEVE₁(filter₃(Y, N, N))

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
SIEVE₁(x1) = x1
cons₂(x1, x2) = cons₁(x2)
s₁(x1) = s
filter₃(x1, x2, x3) = x1
0 = 0

Lexicographic Path Order [19].
Precedence:

s > cons₁
0 > cons₁

The following usable rules [14] were oriented:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, filter₃(Y, N, M))

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(X, filter₃(Y, N, M))
sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(N), sieve₁(filter₃(Y, N, N)))
nats₁(N) -> cons₂(N, nats₁(s₁(N)))
zprimes -> sieve₁(nats₁(s₁(s₁(0))))

The set Q consists of the following terms:

filter₃(cons₂(x0, x1), 0, x2)
filter₃(cons₂(x0, x1), s₁(x2), x3)
sieve₁(cons₂(0, x0))
sieve₁(cons₂(s₁(x0), x1))
nats₁(x0)
zprimes

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.